Sturmian Words and Constant Additive Complexity
نویسنده
چکیده
Resolving a question of Banero, we show that for every integer K > 1, there exists a word with additive complexity identically K. This result is perhaps surprising in light of the rather strong restriction on the existence of words with constant abelian complexity, given in the work of Currie and Rampersad. To prove our result we generalize the notion of a sturmian word. We also pose some questions regarding the existence and structure of words with fixed additive complexity.
منابع مشابه
Permutation complexity of images of Sturmian words by marked morphisms
We show that the permutation complexity of the image of a Sturmian word by a binary marked morphism is n+ k for some constant k and all lengths n sufficiently large.
متن کاملRich, Sturmian, and trapezoidal words
In this paper we explore various interconnections between rich words, Sturmian words, and trapezoidal words. Rich words, first introduced by the second and third authors together with J. Justin and S. Widmer, constitute a new class of finite and infinite words characterized by having the maximal number of palindromic factors. Every finite Sturmian word is rich, but not conversely. Trapezoidal w...
متن کاملIntroducing privileged words: Privileged complexity of Sturmian words
In this paper we study the class of so-called privileged wordswhich have been previously considered only a little. We develop the basic properties of privileged words, which turn out to share similar properties with palindromes. Privileged words are studied in relation to previously studied classes of words, rich words, Sturmian words and episturmian words. A new characterization of Sturmian wo...
متن کاملPeriodic and Sturmian languages
Counting the number of distinct factors in the words of a language gives a measure of complexity for that language similar to the factor-complexity of infinite words. Similarly as for infinite words, we prove that this complexity functions f(n) is either bounded or f(n) ≥ n+1. We call languages with bounded complexity periodic and languages with complexity f(n) = n + 1 Sturmian. We describe the...
متن کاملSome characterizations of finite Sturmian words
In this paper we give some new characterizations of words which are finite factors of Sturmian words. An enumeration formula for primitive finite Sturmian words is given. Moreover, we provide two linear-time algorithms to recognize whether a finite word is Sturmian.
متن کامل